| 翻訳と辞書 |
| Deutsch-Jozsa algorithm ： ウィキペディア英語版 |
Deutsch–Jozsa algorithm
The Deutsch–Jozsa algorithm is a quantum algorithm, proposed by David Deutsch and Richard Jozsa in 1992〔
〕 with improvements by Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca in 1998.〔
〕 Although of little practical use, it is one of the first examples of a quantum algorithm that is exponentially faster than any possible deterministic classical algorithm. It is also a deterministic algorithm, meaning that it always produces an answer, and that answer is always correct.
== Problem statement ==
In the Deutsch-Jozsa problem, we are given a black box quantum computer known as an oracle that implements the function . In layman's terms, it takes n-digit binary values as input and produces either a 0 or a 1 as output for each such value. We are promised that the function is either constant (0 on all inputs or 1 on all inputs) or ''balanced''〔(Certainty from Uncertainty )〕 (returns 1 for half of the input domain and 0 for the other half); the task then is to determine if is constant or balanced by using the oracle.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Deutsch–Jozsa algorithm」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|